Convergence rate analysis of domain decomposition methods for obstacle problems

Convergence rate analysis of domain decomposition methods for obstacle problems

Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems

We consider the problem of minimizing the sum of a strongly convex function and a term comprising the sum of extended real-valued proper closed convex functions. We derive the primal representation of dual-based block descentmethods and establish a relation between primal and dual rates of convergence, allowing to compute the efficiency estimates of different methods. We illustrate the effectiv...

Domain Decomposition Methods for Inverse Problems

Inverse problems related to the estimation of coeecients of partial diierential equations are illposed. Practical applications often use the t-to-data output-least-square's method to recover the coeecients. In this work, we develop parallel nonoverlapping domain decomposition algorithms to estimate the diiusion coeecient associated with elliptic diierential equations. In order to realize the do...

Domain decomposition methods for welding problems

The welding of metals and alloys is a widely used industrial process. Many types of analysis have been carried out on such problems [MUB67]. The numerical thermal analysis of welding is required to take into account such features as temperature dependent material properties, phase change, non-uniform distribution of energy from heat source etc. In this paper, a 2-D non-linear electric arc-weldi...

43 . Domain decomposition methods for welding problems

The welding of metals and alloys is a widely used industrial process. Many types of analysis have been carried out on such problems [MUB67]. The numerical thermal analysis of welding is required to take into account such features as temperature dependent material properties, phase change, non-uniform distribution of energy from heat source etc. In this paper, a 2-D non-linear electric arc-weldi...